Strong duality and minimal representations for cone optimization
نویسندگان
چکیده
The elegant results for strong duality and strict complementarity for linear programming, LP , can fail for cone programming over nonpolyhedral cones. One can have: unattained optimal values; nonzero duality gaps; and no primal-dual optimal pair that satisfies strict complementarity. This failure is tied to the nonclosure of sums of nonpolyhedral closed cones. We take a fresh look at known and new results for duality, optimality, constraint qualifications, and strict complementarity, for linear cone optimization problems in finite dimensions. These results include: weakest and universal constraint qualifications, CQs ; duality and characterizations of optimality that hold without any CQ ; geometry of nice and devious cones; the geometric relationships between zero duality gaps, strict complementarity, and the facial structure of cones; and, the connection between theory and empirical evidence for lack of a CQand failure of strict complementarity. One theme is the notion of minimal representation of the cone and the constraints in order to regularize the problem and avoid both the theoretical and numerical difficulties that arise due to (near) loss of a CQ . We include a discussion on obtaining these representations efficiently. A parallel theme is the loss of strict complementarity and the corresponding theoretical and numerical difficulties that arise; a discussion on avoiding these difficulties is included. We include results and examples on the surprising theoretical connection between duality, strict complementarity, and nonclosure of sums of closed cones. Our emphasis is on results that deal with Semidefinite Programming, SDP . Based on work presented at: ICCOPT II & MOPTA-07, McMaster University, Hamilton, 2007; 9th SIAM Conference on Optimization, Boston, May, 2008; and HPOPT 10, Tilburg, 2008. URL for paper: orion.math.uwaterloo.ca/ ̃hwolkowi/henry/reports/ABSTRACTS.html Research supported by The Natural Sciences and Engineering Research Council of Canada.
منابع مشابه
Exact duality for optimization over symmetric cones
We present a strong duality theory for optimization problems over symmetric cones without assuming any constraint qualification. We show important complexity implications of the result to semidefinite and second order conic optimization. The result is an application of Borwein and Wolkowicz’s facial reduction procedure to express the minimal cone. We use Pataki’s simplified analysis and provide...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملSufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملVector duality for convex vector optimization problems with respect to quasi-minimality
We define the quasi-minimal elements of a set with respect to a convex cone and characterize them via linear scalarization. Then we attach to a general vector optimization problem a dual vector optimization problem with respect to quasi-efficient solutions and establish new duality results. By considering particular cases of the primal vector optimization problem we derive vector dual problems ...
متن کاملWeak and Strong Duality Theorems for Fuzzy Conic Optimization Problems
The objective of this paper is to deal with the fuzzy conic programming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a specific ordering cone is established based on the parameterized representation of fuzzy numbers. Under this setting, duality theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comp. Opt. and Appl.
دوره 53 شماره
صفحات -
تاریخ انتشار 2012